Brzozowski's Algorithm (Co)Algebraically
نویسندگان
چکیده
We give a new presentation of Brzozowski’s algorithm to minimize finite automata, using elementary facts from universal algebra and coalgebra, and building on earlier work by Arbib and Manes on the duality between reachability and observability. This leads to a simple proof of its correctness and opens the door to further generalizations. This paper is dedicated to Dexter Kozen on the occasion of his 60th birthday. Dexter always seeks simplicity and crystal-clear proofs in his research: “a beautiful result deserves a beautiful proof” could be the motto of his work. This paper is a tribute to that .
منابع مشابه
Partial Derivates of Regular Expressions and Finite Automata Constructions
We introduce a notion of a partial derivative of a regular expression. It is a generalization to the non-deterministic case of the known notion of a derivative invented by Brzozowski. We give a constructive definition of partial derivatives, study their properties, and employ them to develop a new algorithm for turning regular expressions into relatively small NFA and to provide certain improve...
متن کامل$(m,n)$-algebraically compactness and $(m,n)$-pure injectivity
In this paper, we introduce the notion of $(m,n)$-algebraically compact modules as an analogue of algebraically compact modules and then we show that $(m,n)$-algebraically compactness and $(m,n)$-pure injectivity for modules coincide. Moreover, further characterizations of a $(m,n)$-pure injective module over a commutative ring are given.
متن کاملOn the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States
We analyze the average complexity of Brzozowski’s minimization algorithm for distributions of deterministic automata with a small number of final states. We show that, as in the case of the uniform distribution, the average complexity is super-polynomial even if we consider random deterministic automata with only one final state. We therefore go beyond the previous study where the number of fin...
متن کاملSplit and join for minimizing: Brzozowski's algorithm
Résumé Brzozowski’s minimization algorithm is based on two successive determinization operations. There is a paradox between its (worst case) exponential complexity and its exceptionally good performance in practice. Our aim is to analyze the way the twofold determinization performs the minimization of a deterministic automaton. We give a characterization of the equivalence classes of w.r.t. th...
متن کاملAn Early-Retirement Plan for the States
New applications of nite automata, such as NLP and asynchronous circuit simulation, can require automata of millions or even billions of states. All known construction methods (in particular, the interesting reachability-based ones that save memory, such as the subset construction, and simultaneously minimizing constructions, such as Brzozowski's) have intermediate memory usage much larger than...
متن کامل